Optimization of signal sets for partial-response channels - I: Numerical techniques

Given a linear, time-invariant, discrete-time channel , the problem of constructing N input signals of finite length K that maximize minimum 1, distance between pairs of outputs is considered. Two constraints on the input signals are consid-e r e d a power constraint on each of the N inputs (hard constraint) a n d a n average power constraint over the entire set of inputs (soft constraint). The hard constraint problem is equivalent to packing N points in a n ellipsoid in min (K , N-1) dimensions to maximize the minimum Euclidean distance between pairs of points. Gradient-based numerical algorithms and a constructive technique based on dense lattices are used to find locally optimal solutions to the preceding signal design problems. Numerical results, consisting of minimum distance vs. input length for different information rates, are given for the son constraint problem. The channels considered are the identity channel, the 1-D channel, a n d the 1-D 2 channel. Signal constellations found via gradient search are superior to the multidimensional lattice constructions when the number of points per dimension is small (i.e., when the information rate is 1 b i t / T or less, 1/T being the symbol rate). The average spectra of optimized signal sets is examined. It is shown that transmitted energy is concentrated into frequency bands where the channel attenuation is relatively small. The measure of this frequency band increases with information rate. It is observed that the average spectrum of a signal set is primarily determined by the shape, or boundary, of the signal constellation, assuming the points are uniformly distributed throughout this region. Two numerical examples are shown for which the average spectrum of a n optimized signal set resembles the water pouring spectrum that achieves Shannon capacity, assuming additive white Gaussian noise.